LEARNING LARGE-ALPHABET AND ANALOG CIRCUITS WITH VALUE INJECTION QUERIES Dana Angluin1 James Aspnes1 Jiang Chen2

Source URL: www.levreyzin.com

• Computational complexity theory
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Complexity classes
• Clique problem
• Boolean circuit
• ACC0
• Clique
• Circuit
• NC

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011

Source URL: courses.csail.mit.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• Analysis of algorithms
• Operations research
• Asymptotic analysis
• Combinatorial optimization
• Dynamic programming
• Master theorem
• Big O notation
• Knapsack problem
• Time complexity

On Noise-Tolerant Learning of Sparse Parities and Related Problems Elena Grigorescu? , Lev Reyzin?? , and Santosh Vempala? ? ? School of Computer Science Georgia Institute of Technology 266 Ferst Drive, Atlanta GA 30332

Source URL: www.levreyzin.com

• Analysis of algorithms
• Computational complexity theory
• Time complexity
• Parity problem
• Parity

check_list_letter_v08 [Converted].ai

Source URL: www.dubberly.com

• Statistics
• Neuropsychology
• Artificial intelligence
• Educational psychology
• Neuropsychological assessment
• Problem solving
• Statistical theory
• Computational complexity theory
• Statistical hypothesis testing
• Mathematical optimization

Two-Sided Bandits and the Dating Market Sanmay Das Center for Biological and Computational Learning and Computer Science and Artificial Intelligence Lab Massachusetts Institute of Technology Cambridge, MA 02139

Source URL: faculty.chicagobooth.edu

• Matching
• Combinatorics
• Game theory
• Fellows of the Econometric Society
• Cooperative games
• Stable marriage problem
• CC
• Reinforcement learning
• Multi-armed bandit
• Alvin E. Roth
• Greedy algorithm
• Algorithm

24th Fall Workshop on Computational Geometry, FWCG 2014, University of Connecticut, October 31–November 1, 2014 The Visibility Freeze-Tag Problem Anna Lubiw Yizhe Zeng Cheriton School of Computer Science

Source URL: fwcg14.cse.uconn.edu

The Ackermann Award 2015 Anuj Dawar, Dexter Kozen, and Simona Ronchi Della Rocca Members of the Jury of the EACSL Ackermann Award Abstract The eleventh Ackermann Award is presented at CSL’15 in Berlin, Germany. This ye

Source URL: drops.dagstuhl.de

• Computability theory
• Theory of computation
• Mathematical logic
• EACSL
• Entscheidungsproblem
• Complexity
• Computational complexity theory
• Algorithm
• Decision problem
• Dexter Kozen

Truth vs. Proof in Computational Complexity Boaz Barak∗ September 24, 2012 Theoretical Computer Science is blessed (or cursed?) with many open problems. For some of these questions, such as the P vs N P problem, it see

Source URL: www.boazbarak.org

SEAProgram Monday, June 29th 8:00 8:50 9:00

Source URL: sea2015.lip6.fr

• NP-complete problems
• Computational complexity theory
• Steiner tree problem
• Combinatorial optimization
• Shortest path problem
• Mathematical optimization
• Independent set
• Combinatorics
• Graph theory
• Book:Graph Theory

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity